APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING
نویسندگان
چکیده
منابع مشابه
Multiple Approximate String Matching
We present a very simple and eecient algorithm for on-line multiple approximate string matching. It uses a previously known counting-based lter 9] that searches for a single pattern by quickly discarding uninteresting parts of the text. Our multi-pattern algorithm is based on the simulation of many parallel lters using bits of the computer word. Our average complexity to search r patterns of le...
متن کاملA Faster Algorithm for Approximate String Matching
We present a new algorithm for on line approximate string matching The algorithm is based on the simulation of a non deterministic nite automaton built from the pattern and using the text as input This simulation uses bit operations on a RAM machine with word length O log n being n the maximum size of the text The running time achieved is O n for small patterns i e m O p log n independently of ...
متن کاملA Consensus Algorithm for Approximate String Matching
Approximate string matching (ASM) is a well-known computational problem with important applications in database searching, plagiarism detection, spelling correction, and bioinformatics. The two main issues with most ASM algorithms are (1) computational complexity, and (2) low specificity due to a large amount of false positives being reported. In this paper, a very efficient ASM method is propo...
متن کاملApproximate String Matching with Ordered q-Grams
Approximate string matching with k differences is considered. Filtration of the text is a widely adopted technique to reduce the text area processed by dynamic programming. We present sublinear filtration algorithms based on the locations of q-grams in the pattern. Samples of q-grams are drawn from the text at fixed periods, and only if consecutive samples appear in the pattern approximately in...
متن کاملAn Improved Algorithm for Approximate String Matching
Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms . • Work supported in part by NSF Grants CCR-86-05353 and CCR-88-14977 1 Department of Computer Science, Columbia University, New York, NY 10...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatics Control Measurement in Economy and Environment Protection
سال: 2017
ISSN: 2083-0157,2391-6761
DOI: 10.5604/01.3001.0010.5214